Multiagent Online Learning in Time-Varying Games

نویسندگان

چکیده

We examine the long-run behavior of multiagent online learning in games that evolve over time. Specifically, we focus on a wide class policies based mirror descent, and show induced sequence play (a) converges to Nash equilibrium time-varying stabilize long run strictly monotone limit, (b) it stays asymptotically close evolving stage (assuming they are strongly monotone). Our results apply both gradient- payoff-based feedback—that is, when players only get observe payoffs their chosen actions. Funding: This research was partially supported by European Cooperation Science Technology COST Action [Grant CA16228] “European Network for Game Theory” (GAMENET). P. Mertikopoulos is grateful financial support French National Research Agency (ANR) framework “Investissements d’avenir” program ANR-15-IDEX-02], LabEx PERSYVAL ANR-11-LABX-0025-01], MIAI@Grenoble Alpes ANR-19-P3IA-0003], ALIAS ANR-19-CE48-0018-01].

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multiagent Reinforcement Learning in Stochastic Games

We adopt stochastic games as a general framework for dynamic noncooperative systems. This framework provides a way of describing the dynamic interactions of agents in terms of individuals' Markov decision processes. By studying this framework, we go beyond the common practice in the study of learning in games, which primarily focus on repeated games or extensive-form games. For stochastic games...

متن کامل

Hierarchical Multiagent Reinforcement Learning in Markov Games

Interactions between intelligent agents in multiagent systems can be modeled and analyzed by using game theory. The agents select actions that maximize their utility function so that they also take into account the behavior of the other agents in the system. Each agent should therefore utilize some model of the other agents. In this paper, the focus is on the situation which has a temporal stru...

متن کامل

Multiagent Social Learning in Large Repeated Games

This thesis studies a class of problems where rational agents can make suboptimal decisions by ignoring a side effect that each individual action brings to bear on the common good. It is generally believed that a mutually desirable strategy can be enforced as a stable outcome for rational agents if the imminent threat exists that any deviator from the strategy will be punished. This thesis expa...

متن کامل

Multiagent learning in large anonymous games

In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to find restricted classes of games where simple, efficient algorithms converge. It is shown that stage learning efficiently converges to Nash equilibria in large anonymous games if bestreply dynamics converge. Two feature...

متن کامل

Experiments with Online Reinforcement Learning in Real-Time Strategy Games

Real-Time Strategy (RTS) games provide a challenging platform to implement online reinforcement learning (RL) techniques in a real application. Computer as one player monitors opponents’ (human or other computers) strategies and then updates its own policy using RL methods. In this paper, we firstly examine the suitability of applying the online RL in various computer games. RL application depe...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Operations Research

سال: 2023

ISSN: ['0364-765X', '1526-5471']

DOI: https://doi.org/10.1287/moor.2022.1283